On subword complexities of homomorphic images of languages

On Subword Complexities of Homomorphic Images of Languages

— The subword complexity of a language K is the function nK on positive integer s such that nK (n) equals the number of different subwords of length n appearing in words of X. We investigate the relationship between nk(K) and nK where Kis a language and h is a homorphism. This study is aiso carried out for the special case when Kis a DOL language. Resumé. — La complexité des facteurs d'un langa...

Subword complexities and iteration

This paper is an overview of results' on the subword complexity of various classes of languages obtained by iterating a mapping, and more precisely on the asymptotic behaviour of this complexity. In the first section we consider iterated morphisms, that is DOL languages. In this area the subword complexity falls into one of five classes, and class membership can be determined. The second sectio...

effect of oral presentation on development of l2 learners grammar

this experimental study has been conducted to test the effect of oral presentation on the development of l2 learners grammar. but this oral presentation is not merely a deductive instruction of grammatical points, in this presentation two hypotheses of krashen (input and low filter hypotheses), stevicks viewpoints on grammar explanation and correction and widdowsons opinion on limited use of l1...

the effect of explicit teaching of metacognitive vocabulary learning strategies on recall and retention of idioms

چکیده ندارد.

On the Subword Complexity and Square-Freeness of Formal Languages